Estimating Learning Rates in Evolution and TDL: Results on a Simple Grid-World Problem Simon M. Lucas Abstract— When learning to play a game or perform some task, it is important to learn as quickly and effectively as

Source URL: game.itu.dk

• Applied mathematics
• Cybernetics
• Machine learning
• Cognitive science
• Evolution
• Genetic algorithms
• Mathematical optimization
• Q-learning
• Reinforcement learning
• Artificial neural network
• Evolutionary computation
• Evolutionary algorithm

1 Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis

Source URL: dept.stat.lsa.umich.edu

• Graph theory
• Mathematics
• Matroid theory
• Matching
• Combinatorial optimization
• Bipartite graph
• Maximum flow problem
• Degree
• Connectivity
• Ear decomposition
• HopcroftKarp algorithm
• Expander graph

Integer Optimization Toolbox Pooya Ronagh∗ August 13, 2013 In what follows, we explain how the Integer Optimization Toolbox approaches the problem of minimization of a (low degree) polynomial over an integer lattice. I

Source URL: www.1qbit.com

Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc

Source URL: www.ijimai.org

• Operations research
• Computational complexity theory
• Scheduling
• Mathematics
• Applied mathematics
• NP-hard problems
• Complexity classes
• Mathematical optimization
• Flow shop scheduling
• Makespan
• Combinatorial optimization
• Schedule

Training-Time Optimization of a Budgeted Booster Yi Huang, Brian Powers, Lev Reyzin {yhuang,bpower6,lreyzin}@math.uic.edu Problem Setting

Source URL: www.levreyzin.com

• Ensemble learning
• Artificial intelligence
• Learning
• AdaBoost
• Boosting

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar

Source URL: www.cs.rpi.edu

• Matching
• Combinatorics
• NP-complete problems
• Combinatorial optimization
• Spanning tree
• Stable marriage problem
• Approximation algorithm
• 3-dimensional matching
• Minimum spanning tree

On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Source URL: www.cs.rpi.edu

• Combinatorial optimization
• Graph theory
• NP-complete problems
• Network theory
• Edsger W. Dijkstra
• Steiner tree problem
• Simplex
• Matching
• Bipartite graph
• Graph
• Shortest path problem
• A* search algorithm

MCS 521 – Combinatorial Optimization Fall 2013 Problem Set 2 Lev Reyzin Due: at the beginning of class

Source URL: homepages.math.uic.edu

Deterministic MDPs with Adversarial Rewards and Bandit Feedback Raman Arora TTIC 6045 S. Kenwood Ave. Chicago, IL 60637, USA

Source URL: dept.stat.lsa.umich.edu

• Markov models
• Markov processes
• Stochastic optimization
• Mathematical optimization
• Operations research
• Reinforcement learning
• Markov decision process
• Algorithm
• Multi-armed bandit
• Dynamic programming
• Shortest path problem
• PP